Incomplete stable structures in symmetric convex games

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symmetric Incomplete Information Games as Stochastic Games

The purpose of this chapter is to show how games with incomplete information in fact reduce to stochastic games, as long as the information is symmetric among the players. The new state space corresponds to the beliefs on the space of unknown parameters.

متن کامل

An incomplete information justification of symmetric equilibrium in symmetric games

Consider a symmetric 2-player game of complete information. Consider an arbitrary Bayesian extension of that game with payoff-irrelevant types, independent random matching, and anonymity (private types). We show that, in this setting, while strategies in a Bayesian Nash equilibrium of that game can differ across types, aggregate play in any such equilibrium must coincide with a symmetric Nash e...

متن کامل

Repeated Games of Incomplete Information: The Symmetric Case

It is shown that in every repeated zero-sum game of incomplete information in which the information to both players is identical, lim v n and v ∞ exist and are equal.

متن کامل

Event Structures, Stable Families and Concurrent Games

ion λx ∶ A.σ ∶ A⊸ B. Because probabilistic strategies form a monoidalclosed bicategory, with tensor A∥B and function space A⊸ B =def A ⊥∥B, they support an (linear) λ-calculus, which in this context permits process-passing as in [?]. Recursive types and probabilistic processes can be dealt with along standard lines [?]. The types as they stand are somewhat inflexible. For example, that maps of ...

متن کامل

Computing stable outcomes in symmetric additively-separable hedonic games

We study the computational complexity of finding stable outcomes in hedonic games, which are a class of coalition formation games. We restrict our attention to symmetric additively-separable hedonic games, which are a nontrivial subclass of such games that are guaranteed to possess stable outcomes. These games are specified by an undirected edgeweighted graph: nodes are players, an outcome of t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Games and Economic Behavior

سال: 2004

ISSN: 0899-8256

DOI: 10.1016/j.geb.2003.06.001